Algorithms for determining a node-disjoint path pair visiting specified nodes
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are al...
متن کاملEfficient algorithms for minimal disjoint path problems on chordal graphs
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(| V | | E |) algorithm for 2 edge disjoint paths ...
متن کاملAlgorithms for finding disjoint path covers in unit interval graphs
A many-to-many k-disjoint path cover (k-DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k, is a collection of k vertex-disjoint paths between S and T , which altogether cover every vertex of G. This is classified as paired, if each vertex of S must be joined to a specific vertex of T , or unpaired, if there is no such constraint. In this paper, we de...
متن کاملFault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...
متن کاملEdge disjoint cycles through specified vertices
We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles, each of which contains a prescribed set W of vertices. The condition is that the induced subgraph G[W ] be 2k-connected, and that for any two vertices at distance two in G[W ], at least one of the two has degree at least |V (G)|/2 + 2(k − 1) in G. This is a common generalization of special cases previou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Switching and Networking
سال: 2017
ISSN: 1573-4277
DOI: 10.1016/j.osn.2016.05.002